Average consensus on general strongly connected digraphs
نویسندگان
چکیده
منابع مشابه
Average Consensus on General Strongly Connected Digraphs
We study the average consensus problem of multi-agent systems for general network topologies with unidirectional information flow. We propose two (linear) distributed algorithms, deterministic and gossip, respectively for the cases where the inter-agent communication is synchronous and asynchronous. Our contribution is that in both cases, the developed algorithms guarantee state averaging on ar...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملConsensus on the Average on Arbitrary Strongly Connected Digraphs Based on Broadcast Gossip Algorithms
In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...
متن کاملAverage consensus on strongly connected weighted digraphs: A generalized error bound
This technical communique represents a generalization of the convergence analysis for the consensus algorithm proposed in Priolo et al. (2014). Although the consensus was reached for any strongly connected weighted digraphs (SCWD), the convergence analysis provided in Priolo et al. (2014) was only valid for diagonalizable matrices encoding a SCWD. The result we present here generalizes the prev...
متن کاملStrongly Connected Multivariate Digraphs
Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by Robert Grone in 1987. By viewing matrix multiplication as a special case of this tensor m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2012
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2012.08.003